Argument-based explanation of logic programs
نویسندگان
چکیده
The paper argues that a satisfactory explanation of a logic program must take the form of an argument, rather than a proof. This can only be done on the basis of information regarding the role of the various literals in the bodies of the clauses, which is normally not captured by such programs. A schema for arguments, derived from Toulmin, is presented, and the components of this schema are related to the roles of literals in the bodies of clauses. A metainterpreter is described that uses annotations of body literals to build up an argument structure according to this schema. This structure can then be used to present the argument in a variety of ways; this is illustrated by a discussion of how the argument structure can be used as the basis of a presentation as a paragraph of text. A simple example from a quasilegal domain is presented.
منابع مشابه
Slicing Concurrent Logic Programs
Program slicing has been widely studied for imperative programs, but for logic programs it is just starting. In this paper we address the problem of slicing concurrent logic programs. To solve this problem, we propose three types of primary program dependences between arguments in concurrent logic programs, named the sharing dependence, communication dependence and uni cation dependence. We als...
متن کاملRedundant Argument Filtering of Logic Programs
This paper is concerned with the problem of removing, from a given logic program, redundant arguments. These are arguments which can be removed without affecting correctness. Most program specialisation techniques, even through they perform argument filtering and redundant clause removal, fail to remove a substantial number of redundant arguments, yielding in some cases rather inefficient resid...
متن کاملThe Argument Dependence Net and Its Use in a Concurrent Logic Programming Environment
This paper presents three types of primary program dependences in concurrent logic programs, and a dependence-based representation named the argument dependence net (ADN) to explicitly represent these program dependences in a concurrent logic program. The ADN can be used as an underlying representation for developing software engineering tools for concurrent logic programs.
متن کاملLogical Argumentation, Abduction and Bayesian Decision Theory: A Bayesian Approach to Logical Arguments and its Application to Legal Evidential Reasoning
There are good normative arguments for using Bayesian decision theory for deciding what to do. However, there are also good arguments for using logic, where we want have a formal semantics for a language and use the structure of logical argumentation with logical variables to represent multiple individuals (things). This paper shows how decision theory and logical argumentation can be combined ...
متن کاملComputing Executable Slices for Concurrent Logic Programs
Program Slicing has many applications in software engineering activities. However, until recently, no slicing algorithm has been presented that can compute executable slices for concurrent logic programs. In this paper we present a dependence-graph based approach to computing executable slice for concurrent logic programs. The dependence-based representation used in this paper is called the Arg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Knowl.-Based Syst.
دوره 4 شماره
صفحات -
تاریخ انتشار 1991